﻿//
// (C) Copyright 2009 Irantha Suwandarathna (iranthas@hotmail.com)
// All rights reserved.
//

/* Copyright (c) 2001-2008, The HSQL Development Group
 * All rights reserved.
 *
 * Redistribution and use _in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * Redistributions of source code must retain the above copyright notice, this
 * list of conditions and the following disclaimer.
 *
 * Redistributions _in binary form must reproduce the above copyright notice,
 * this list of conditions and the following disclaimer _in the documentation
 * and/or other materials provided with the distribution.
 *
 * Neither the name of the HSQL Development Group nor the names of its
 * contributors may be used to endorse or promote products derived from this
 * software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED. IN NO EVENT SHALL HSQL DEVELOPMENT GROUP, HSQLDB.ORG,
 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using EffiProz.Core.Store;

namespace EffiProz.Core.Lib
{
    public class HashSet : BaseHashMap, Set
    {
        public HashSet()
            : this(8)
        {

        }

        public HashSet(int initialCapacity)
            : base(initialCapacity, BaseHashMap.objectKeyOrValue, BaseHashMap.noKeyOrValue,
                false)
        {

        }

        public bool contains(Object key)
        {
            return base.containsKey(key);
        }

        public bool containsAll(Collection col)
        {

            Iterator it = col.iterator();

            while (it.hasNext())
            {
                if (contains(it.next()))
                {
                    continue;
                }

                return false;
            }

            return true;
        }

        public Object get(Object key)
        {

            int lookup = getLookup(key, key.GetHashCode());

            if (lookup < 0)
            {
                return null;
            }
            else
            {
                return objectKeyTable[lookup];
            }
        }

        public bool add(Object key)
        {

            int oldSize = size();

            base.addOrRemove(0, 0, key, null, false);

            return oldSize != size();
        }

        public bool addAll(Collection c)
        {

            int oldSize = size();
            Iterator it = c.iterator();

            while (it.hasNext())
            {
                add(it.next());
            }

            return oldSize != size();
        }

        public bool addAll(Object[] keys)
        {

            bool changed = false;

            for (int i = 0; i < keys.Length; i++)
            {
                if (add(keys[i]))
                {
                    changed = true;
                }
            }

            return changed;
        }

        public virtual bool remove(Object key)
        {

            int oldSize = size();

            base.removeObject(key , false);

            return oldSize != size();
        }

        public bool removeAll(Collection c)
        {

            Iterator it = c.iterator();
            bool result = true;

            while (it.hasNext())
            {
                result &= remove(it.next());
            }

            return result;
        }

        public Object[] toArray(Object[] a)
        {

            if (a == null || a.Length < size())
            {
                a = new Object[size()];
            }

            Iterator it = iterator();

            for (int i = 0; it.hasNext(); i++)
            {
                a[i] = it.next();
            }

            return a;
        }

        public Iterator iterator()
        {
            return new BaseHashIterator(this, true);
        }

        /**
         * Returns a String like "[Drei, zwei, Eins]", exactly like
         * java.util.HashSet.
         */
        public String toString()
        {

            Iterator it = iterator();
            StringBuilder sb = new StringBuilder();

            while (it.hasNext())
            {
                if (sb.Length > 0)
                {
                    sb.Append(", ");
                }
                else
                {
                    sb.Append('[');
                }

                sb.Append(it.next());
            }

            return sb.ToString() + ']';
        }
    }
}
